Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining by Hassan AbouEisha Talha Amin Igor Chikalov Shahid Hussain & Mikhail Moshkov

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining by Hassan AbouEisha Talha Amin Igor Chikalov Shahid Hussain & Mikhail Moshkov

Author:Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain & Mikhail Moshkov
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham


then is a strictly increasing cost function for systems of decision rules.

We now consider a notion of uncertainty for systems of decision rules. This is a function which is defined on pairs T, S, where T is a nonempty decision table and is a system of decision rules for T, and has values from the set . This function is given by uncertainty measure U and a function . The value is equal to where the value , for any natural k, is defined by induction: and, for , .

References

1.

Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Dagger: A tool for analysis and optimization of decision trees and rules. In: Ficarra, F.V.C., Kratky, A., Veltman, K.H., Ficarra, M.C., Nicol, E., Brie, M. (eds.) Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiencies in the Era of Communicability Expansion, pp. 29–39. Blue Herons (2011)



Download



Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.